Robust LRTDP: Reachability Analysis
نویسنده
چکیده
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reachable. This paper presents an algorithm checking for goal reachability, especially in the complex case of an uncertain SSP where only a possible interval is known for each transition probability. This gives an analysis method for determining if SSP algorithms such as RTDP are applicable, even if the exact model is not known. We aim at a symbolic analysis in order to avoid a complete state-space enumeration.
منابع مشابه
Topological Value Iteration Algorithm for Markov Decision Processes
Value Iteration is an inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed. Among them, LAO*, LRTDP and HDP are state-of-theart ones. All of these use reachability analysis and heuristics t...
متن کاملLRTDP Versus UCT for Online Probabilistic Planning
UCT, the premier method for solving games such as Go, is also becoming the dominant algorithm for probabilistic planning. Out of the five solvers at the International Probabilistic Planning Competition (IPPC) 2011, four were based on the UCT algorithm. However, while a UCT-based planner, PROST, won the contest, an LRTDP-based system, GLUTTON, came in a close second, outperforming other systems ...
متن کاملSafe & Robust Reachability Analysis of Hybrid Systems
Hybrid systems—more precisely, their mathematical models—can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of reachability—namely, the reflexive and transitive closure of a transition relation—can be unsafe, ie, it may compute a proper subset of the set of states reachable in...
متن کاملA Real-Time Dynamic Programming Approach for the Resource Allocation of a Frigate
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem the Labeled Real-Time Dynamic Programming (lrtdp) approaches is applied in an effective way. lrtdp concentrates the planning on significant states of the environment only, as the search is guided by an initial heuristic. As demonstrated...
متن کاملRobust Reachability in Timed Automata: A Game-Based Approach
Reachability checking is one of the most basic problems in verification. By solving this problem, one synthesizes a strategy that dictates the actions to be performed for ensuring that the target location is reached. In this work, we are interested in synthesizing “robust” strategies for ensuring reachability of a location in a timed automaton; with “robust”, we mean that it must still ensure r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004